On an additive representation function

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining additive representations on subsets into an overall representation

Many traditional conjoint representations of binary preferences are additively decomposable, or additive for short. An important generalization arises under rank-dependence, when additivity is restricted to cones with a fixed ranking of components from best to worst (comonotonicity), leading to configural weighting, rank-dependent utility, and rankand sign-dependent utility (prospect theory). T...

متن کامل

compactifications and function spaces on weighted semigruops

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

15 صفحه اول

On an Additive Prime Divisor Function of Alladi and Erdős

This paper discusses the additive prime divisor function A(n) := ∑ pα||n αp which was introduced by Alladi and Erdős in 1977. It is shown that A(n) is uniformly distributed (mod q) for any fixed integer q > 1.

متن کامل

1 0 Fe b 20 03 Every function is the representation function of an additive basis for the integers ∗

Let A be a set of integers. For every integer n, let rA,h(n) denote the number of representations of n in the form n = a1 + a2 + · · ·+ ah, where a1, a2, . . . , ah ∈ A and a1 ≤ a2 ≤ · · · ≤ ah. The function rA,h : Z → N0 ∪ {∞} is the representation function of order h for A. The set A is called an asymptotic basis of order h if r A,h(0) is finite, that is, if every integer with at most a finit...

متن کامل

On Generalized Additive Value-Function Decomposition

We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation focused on structured models that provide a factored representation of users’ preferences. Such models require less information to construct and support efficient reasoning algorithms. This paper makes two substantial con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2004

ISSN: 0022-314X

DOI: 10.1016/j.jnt.2003.09.004